COMMENT ⊗   VALID 00005 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.ASEC(Bibliography)
C00004 00003	. ASSEC(References)
C00018 00004	Kershner, R.B., and L.R.Wilcox, 4The Anatomy of Mathematics*, The Ronald
C00034 00005	.ASSECP(Documentation)
C00038 ENDMK
C⊗;
.ASEC(Bibliography)

Of all the articles,  books, and memos which were  read as background
for AM, I have  selected those which had some impact on that work (or
at least, on this document).  While still large, they form a far from
comprehensive  list of  publications  dealing  with automated  theory
formation, AI in general, and with how mathematicians do research.

.ONCE TURN ON "{}";

After  the  listing of  these  references, Appendix  {ASECNUM}.2 will
provide some  pointers to  real-world documentation,  the AM  program
itself, etc.

.BIB: ASECNUM ;

. ASSEC(References)


.BEGIN FILL SINGLE SPACE  PREFACE 1 INDENT 0,4,0 ; ONCE PREFACE 2

Adams, James L., ⊗4Conceptual Blockbusting⊗*, W.H. Freeman and Co.,
San Francisco, 1974.

Amarel, Saul, ⊗4On Representations and Modelling in Problem Solving and On
Future Directions for Intelligent Systems⊗*, RCA Labs Scientific Report No. 2,
Princeton, 1967.

Atkin, A. O. L., and Birch, B. J., eds., ⊗4Computers in Number Theory⊗*,
Proceedings of the 1969 SRCA Oxford Symposium, Academic Press, New York, 
1971.

Badre, Nagib A., ⊗4Computer Learning From English Text⊗*, Memorandum
No. ERL-M372, Electronics Research Laboratory, UCB, December 20, 1972.
Also summarized in ⊗4CLET -- A Computer Program that Learns Arithmetic
from an Elementary Textbook⊗*, IBM Research Report RC 4235, February
21, 1973.


Berliner, Hans, ⊗4Chess as Problem Solving: The Development of a Tactics Analyzer⊗*,
Carnegie-Mellon University Computer Science Department Thesis, March, 1974.

Beth, Evert W., and Piaget, Jean, ⊗4Mathematical Epistemology and
Psychology⊗*, Gordon and Breach, New York, 1966.

Beveridge, W. I., ⊗4The Art of Scientific Investigation⊗*, Vintage Books, N.Y. 1950.

Biermann, Alan W., ⊗4Approaches to Automatic Programming⊗*, in Advances
in Computers, Volume 15, Academic Press, 1976.

Black, Max, ⊗4Margins of Precision⊗*, Cornell University Press,
Ithaca, New York, 1970.

Blalock, H. M., ⊗4Theory Construction⊗*, Prentice-Hall, Englewood Cliffs,
N.J., 1969.

Bledsoe, W. W., ⊗4Splitting and Reduction Heuristics in Automatic
Theorem Proving⊗*, Artificial Intelligence 2, 1971, pp. 55-77.

Bledsoe and Bruell, Peter, ⊗4A Man-Machine Theorem-Proving System⊗*,
Artificial Intelligence 5, 1974, 51-72.

Bobrow, D., and A. Collins, (eds.), ⊗4Representation and Understanding⊗*,
Academic Press, S.F., 1975.

Bobrow, D., and D. Norman, ⊗4Some Principles of Memory Schemata⊗*,
XEROX PARC  Memo CSL 75-4, Palo Alto, July, 1975.

Bobrow, Daniel G., and Terry Winograd,
⊗4An Overview of KRL, A Knowledge Representation Language⊗*,
Journal of Cognitive Science, Vol 1, No 1, January 1977.

Bourbaki, Nicholas, ⊗4The Architechture of Mathematics⊗*, American Mathematics
Monthly, v. 57, pp. 221-232, Published by the MAA, Albany, NY, 1950.

Boyer, Robert S., and J S. Moore, ⊗4Proving Theorems about LISP Functions⊗*,
JACM, V. 22, No. 1, January, 1975, pp. 129-144.

Brotz, Douglas K., ⊗4Embedding Heuristic Problem Solving Methods in a
Mechanical Theorem Prover⊗*, dissertation published as Stanford Computer
Science Report STAN-CS-74-443, August, 1974.

Bruijn, N. G. de, ⊗4AUTOMATH, a language for mathematics⊗*, Les Presses de
L'Universite de Montreal, Montreal, 1973.

Buchanan, Bruce G., G. Sutherland, and E. Feigenbaum, ⊗4Heuristic Dendral:
A Program for Generating Explanatory Hypotheses in Organic Chemistry⊗*,
in (Meltzer and Michie, eds.) Machine Intelligence 4, American Elsevier Pub.,
N.Y., 1969, pp. 209-254.

Buchanan, Bruce G., E. Feigenbaum, and Sridharan, 
⊗4Heuristic Theory Formation⊗*,
Machine Intelligence 7, 1972, pp. 267-290.

Buchanan, Bruce G., ⊗4Scientific Theory Formation by Computer⊗*,
NATO Advanced Study Institute on Computer Oriented Learning Processes,
Bonas, France, 1974.

Buchanan, Bruce G., ⊗4Applications of Artificial Intelligence to Scientific
Reasoning⊗*, Second USA-Japan Computer Conference, 
Tokyo, August 26-28.
Published by AFIPS and IPSJ,
Tokyo, 1975, pp. 189-194.

Bundy, Alan, ⊗4Doing Arithmetic with Diagrams⊗*, 3rd International
Joint  Conference on Artificial Intelligence (IJCAI), Stanford,
1973, pp. 130-138.

Burstall, R., and J. Darlington, ⊗4A Transformation System for Developing
Recursive Programs⊗*, University of Edinburgh AI Research Report,  March, 1976.


Church, A., ⊗4The calculi of Lambda-conversion⊗*, Princeton University Press,
Princeton, 1941.

Cohen, Paul J., ⊗4Set Theory and the Continuum Hypothesis⊗*,  W.A.Benjamin, Inc.,
New York, 1966.

Colby, Kenneth Mark, "Simulations of belief systems", in [Schank and Colby 73].

Copeland, Richard W., ⊗4How Children Learn Mathematics⊗*, The MacMillan
Company, London, 1970.

Courant, Richard, and Robins, Herbert, ⊗4What is Mathematics⊗*, 
Oxford University Press, New York, 1941.

Dahl, Ole-Johan, et. al., ⊗4SIMULA-67: A Common Base Language⊗*, Norwegian
Computing Center Publication No. S-2, Oslo, 1968.

Darlington, J., and R. Burstall, 
⊗4A System Which Automatically Improves
Programs⊗*, 3rd IJCAI, 1973, pp. 479-485. 

Davis, R., and J. King, ⊗4An Overview of Production Systems⊗*,
Stanford AI Lab Memo 271, October, 1975.

Davis, Randall, ⊗4Applications of Meta Level Knowledge to the Construction,
Maintenance and Use of Large Knowledge Bases,⊗* Stanford AI Lab Memo 283, July, 1976.

Dijkstra, Edsger W., ⊗4A Discipline of Programming⊗*, Prentice-Hall, Inc., 
Englewood Cliffs, N.J., 1976.


Eddington, Sir Arthur Stanley, ⊗4New Pathways in Science⊗*, Macmillan Co. N.Y., 1935.

Engelman, C., ⊗4MATHLAB: A Program for On-Line Assistance in Symbolic Computation⊗*,
in Proceedings of the FJCC, Volume 2, Spartan Books, 1965.

Engelman, C., ⊗4MATHLAB '68⊗*, in IFIP, Edinburgh, 1968.

Evans, Thomas G., ⊗4A 
Program for the Solution of Geometric-Analogy Intelligence Test
Questions⊗*, in [Minsky 68], pp. 271-353.

Eynden, Charles Vanden, ⊗4Number Theory: An Introduction to Proof⊗*, 
International Textbook Company, Scranton, Pennsylvania, 1970.

Feigenbaum, Edward A., ⊗4EPAM: The Simulation of Verbal Learning Behavior⊗*, in
[Feigenbaum & Feldman 63], Part 2, Section 2, pp. 297-309.

Feigenbaum, Edward A., and Julian Feldman (eds.), ⊗4Computers and
Thought⊗*, McGraw-Hill Book Company, New York, New York, 1963.

Feigenbaum, E., B. Buchanan,
and J. Lederberg,
⊗4On Generality and Problem Solving: A Case
Study Using The DENDRAL Program⊗*, in (eds Meltzer and Michie) Machine
Intelligence 6, 1971, pp 165-190.

Fogel, Lawrence, A. Owens, and M. Walsh, ⊗4Artificial Intelligence
Through Simulated Evolution⊗*, John Wiley & Sons, Inc., N.Y., 1966.
 
Fuller, R. Buckminster, ⊗4Synergetics⊗*, Macmillan Co., N.Y., 1975.

Gardner, Martin, ⊗4Mathematical Games⊗*, Scientific American, numerous columns,
including especially:  February, 1975.

Gelernter, H., ⊗4Realization of a Geometry-Theorem Proving Machine⊗*,
in [Feigenbaum & Feldman 63], Part 1, Section 3,
pages 134-152.

Goldstein, Ira, ⊗4Elementary Geometry Theorem Proving⊗*, MIT AI Memo 280,
April, 1973.

Goodstein, R. L., ⊗4Fundamental Concepts of Mathematics⊗*, Pergamon Press, 
New York, 1962.

Green, Waldinger, Barstow, Elschlager, Lenat, McCune, Shaw, and Steinberg,
⊗4Progress Report on Program-Understanding Systems⊗*, Memo AIM-240,
CS Report STAN-CS-74-444,Artificial Intelligence Laboratory,
Stanford University, August, 1974.

Guard, J. R., et al., ⊗4Semi-Automated Mathematics⊗*, JACM 16,
January, 1969, pp. 49-62.

Hadamard, Jaques, ⊗4The Psychology of Invention in the Mathematical
Field⊗*, Dover Publications, New York, 1945.

Halmos, Paul R., ⊗4Innovation in Mathematics⊗*, in
[Kline 68].
Originally in
Scientific American, September, 1958.

Hardy, G. H.,  and E. M. Wright, ⊗4An Introduction to the Theory of Numbers⊗*,
Oxford U. Press, London, 1938. (Fourth edition, 1960)

Hayes-Roth, Frederick, and Victor R. Lesser, ⊗4Focus of Attention in a Distributed
Speech Understanding System⊗*, Computer Science Dept. Memo , Carnegie Mellon
University, Pittsburgh, Pa., January 12, 1976.

Hempel, Carl G., ⊗4Fundamentals of Concept Formation in Empirical
Science⊗*, University of Chicago Press, Chicago, 1952.

Hewitt, Carl, ⊗4A Universal Modular ACTOR Formalism for
Artificial Intelligence⊗*, Third International Joint Conference on
Artificial Intelligence,
1973, pp. 235-245.

Hewitt, Carl, ⊗4Viewing Control Structures as Patterns of Passing Messages⊗*,
MIT AI Lab Working Paper 92, April, 1976.

Hilpinen, Risto, ⊗4Rules of Acceptance and Inductive Logic⊗*, Acta
Philosophica Fennica, Fasc. 22, North-Holland Publishing Company,
Amsterdam, 1968.

Hintikka, Jaako, ⊗4Knowledge and Belief⊗*, Cornell U. Press, Ithaca, NY, 1962.

Hintikka, Jaako, and Suppes, Patrick (eds.), ⊗4Aspects of Inductive
Logic⊗*, North-Holland Publishing Company, Amsterdam, 1966.

Iberall, Arthur S., ⊗4Toward a General Science of Viable Systems⊗*,
McGraw-Hill Book Co., N.Y. 1972.

Kershner, R.B., and L.R.Wilcox, ⊗4The Anatomy of Mathematics⊗*, The Ronald
Press Company, New York, 1950.

Kline, M. (ed), ⊗4Mathematics in the Modern World: Readings from Scientific
American⊗*, W.H.Freeman and Co., San Francisco, 1968.

Kling, Robert Elliot, ⊗4Reasoning by Analogy with Applications to Heuristic
Problem Solving: A Case Study⊗*, Stanford Artificial Intelligence Project
Memo AIM-147, CS Department report CS-216, August, 1971.

Kling, Robert E., ⊗4A Paradigm for Reasoning by Analogy⊗*,
Artificial Intelligence 2, 1971, pp. 147-178.

Knuth, Donald, 
⊗4Fundamental Algorithms⊗*, volume 1 of
⊗4The Art of Computer Programming⊗*, Addison-Wesley Publishing Company,
Menlo Park, 1968.

Knuth, Donald, ⊗4Surreal Numbers⊗*, Addison-Wesley Publishing Company,
Reading, Mass., l974.

Knuth,Donald E., ⊗4Ancient Babylonian Algorithms⊗*,
CACM 15, July, 1972, pp. 671-677.

Koestler, Arthur, ⊗4The Act of Creation⊗*,  New York, Dell Pub., 1967.

Koppelman, Elaine, "Progress in Mathematics", in the ⊗4Proceedings of the
Workshop on the Historical Development of Modern Mathematics⊗*, July, 1975.

Lamon, William E., ⊗4Learning and the Nature of Mathematiccs⊗*, Science
Research Associates, Palo Alto, 1972.

Lederberg, Joshua, ⊗4DENDRAL-64: A System for Computer Construction,
Enumeration, and Notation of Organic Molecules as Tree Structures and
Cyclic Graphs⊗*, Parts I-V of the Interim Report to NASA, 1964.

Lederberg, Joshua;  Review of [Weizenbaum 76], published in New York Times, 1976.

Lefrancois, Guy R., ⊗4Psychological Theories and Human Learning⊗*, 1972.

Lenat, D., ⊗4Synthesis of Large Programs from Specific Dialogues⊗*,
Proceedings of the
International Symposium on Proving and Improving Programs, Le Chesnay,
France, July, 1975a.

Lenat, D., ⊗4BEINGs: Knowledge as Interacting Experts⊗*, 4th IJCAI, Tbilisi,
Georgian SSR, USSR, 1975b.

Lesser, V., R.D. Fennell, L. D. Erman, and D. R. Reddy, ⊗4Organization of
the Hearsay-II Speech Understanding System⊗*, in IEEE Transactions on
Acoustics, Speech, and Signal Processing, Volume ASSP-23, 1975, pp. 11-23.

Linderholm, Carl E., ⊗4Mathematics Made Difficult⊗*, World Publishing Co., N.Y. 1972.

Lombardi, L.A., and B. Raphael, ⊗4LISP as the language for an incremental
computer⊗*, in 
(E. C. Berkeley and D. G. Bobrow, eds.)
⊗4The Programming Language LISP: Its Operation and Applications,⊗*
Information
International Inc., 1964.

Low, James R.,  ⊗4Automatic Coding: Choice of Data Structures,⊗*
SAIL AI Memo AIM-242, August, 1974. 

McDermott, Drew, ⊗4Artificial Intelligence Meets Natural Stupidity⊗*,
in Sigart Newsletter, No. 57, April, 1976, pp. 4-9.

Martin, W., and R. Fateman, ⊗4The MACSYMA System⊗*, in (S. Petrick, ed.) Second
Symposium on Symbolic and Algebraic Manipulation,
ACM SIGSAM, N.Y. (conference was held in Los Angeles),
1971, pp. 59-75.

Minsky, Marvin, editor, ⊗4Semantic Information Processing⊗*, The
MIT Press, Cambridge, Massachusetts, 1968.

Minsky, Marvin, ⊗4Frames⊗*, in [Winston 75].

Mirsky, L., ⊗4Studies in Pure Mathematics⊗*, Academic Press, New
York, 1971.

Moore, J S., ⊗4Introducing Iteration into the Pure LISP Theorem Prover⊗*,
XEROX PARC report CSL-74-3, Palo Alto, 1975.

Moore, Jim and Allen Newell, "How can MERLIN understand?,"
in Gregg (ed.) ⊗4Knowledge and Cognition,⊗* Lawrence
Erlbaum Associates, 1973.

Moore, Robert C., ⊗4D-SCRIPT: A Computational Theory of Descriptions⊗*,
MIT AI Memo 278, February, 1973.

Neumann, J. von, ⊗4The Mathematician⊗*, in R.B. Heywood (ed), ⊗4The Works
of the Mind⊗*, U. Chicago Press, pp. 180-196, 1947.

Nevins, Arthur J., ⊗4A Human Oriented Logic for Automatic Theorem
Proving⊗*, MIT AI Memo 268, October, 1972.

Nevins, Arthur J., ⊗4Plane Geometry Theorem Proving Using Forward Chaining⊗*,
Artificial Intelligence 6, Spring 1975, pp. 1-23.

Newell, A. "Heuristic Programming: Ill-Structured Problems", in
(ed. Aronofsky, A.) ⊗4Progress in Operations Research III⊗*, 
John Wiley and Sons, 1969.

Newell, A., ⊗4Production Systems: Models of Control Structures⊗*, May,
1973 CMU Report, also published in (W.G. Chase, ed.) ⊗4Visual
Information Processing⊗*, NY: Academic Press, Chapter 10, pp. 463-526. 

Newell, Allen, J. Shaw, and H. Simon, ⊗4Empirical Explorations of the Logic
Theory Machine: A Case Study in Heuristics⊗*, RAND Corp. Report P-951,
March, 1957.

Newell, Allen, and Simon, Herbert, ⊗4Human Problem Solving⊗*,
Prentice-Hall, Englewood Cliffs, New Jersey, 1972. 

Newell, Allen, and Simon, Herbert, ⊗4Computer Science as Empirical Inquiry: Symbols
and Search⊗*, the 1975 ACM Turing Award Lecture, printed in CACM 19, No. 3,
March, 1976, pp. 113-126.

Nilsson, Nils J., ⊗4Problem-solving Methods in Artificial
Intelligence⊗*, McGraw-Hill Book Company, New York, New York, 1971

Norman, D., and D. Bobrow, ⊗4On Data-limited and Resource-limited Processes⊗*,
Journal of Cognitive Psychology, Volume 7, 1975, pp. 44-64.

Norman, D., and D. Rumelhart, ⊗4Explorations in Cognition⊗*, W. H. Freeman & Co.,
S.F., 1975.

Ore, Oystein, ⊗4Number Theory and its History⊗*, McGraw-Hill, 
New York, 1948.

Papert, Seymour, ⊗4Teaching Children to be Mathematicians Versus Teaching
About Mathematics⊗*, in the International Journal of Mathematical Education in
Science and Technology, Volume 3, No. 3, July-September, 1972, pp. 249-262.

Piaget, J., ⊗4The Language and Thought of the Child⊗*, The World Publishing Co.,
N.Y., 1955.

Pietarinen, Juhani, ⊗4Lawlikeness, Analogy, and Inductive Logic⊗*,
North-Holland, Amsterdam, published as v. 26 of the series
Acta Philosophica Fennica (J. Hintikka, ed.), 1972.

Pitrat, Jacques, ⊗4Heuristic Interest of using Metatheorems⊗*,
Symposium on Automatic Demonstration, Springer-Verlag, 1970.

Poincare', Henri, ⊗4The Foundations of Science: Science and Hypothesis,
The Value of Science, Science and Method⊗*, The Science Press, New York,
1929. 

Polya, George, ⊗4Mathematics and Plausible Reasoning⊗*, Princeton
University Press, Princeton, Vol. 1, 1954;  Vol. 2, 1954.

Polya, George, ⊗4How To Solve It⊗*, Second Edition, Doubleday Anchor Books, 
Garden City, New York, 1957.

Polya, George, ⊗4Mathematical Discovery⊗*, John Wiley & Sons,
New York, Vol. 1, 1962; Vol. 2, 1965.

Ramanujan, Srinivasa A., ⊗4Collected Papers⊗*, (Hardy, Aiyar, Wilson, eds.),
Chelsea Publishing Company, N. Y., 1927.

Rulifson, Jeff, 
J. Derksen, and R. Waldinger,
⊗4QA4: A Procedural Calculus for Intuitive Reasoning⊗*, SRI Project 8721,
Technical Note 73, Artificial Intelligence Center, SRI, Menlo
Park, California, November, 1972.

Saaty, Thomas L., and Weyl, F. Joachim (eds.), ⊗4The Spirit and the Uses
of the Mathematical Sciences⊗*, McGraw-Hill Book Company, New York, 1969.

Samuel, A., ⊗4Some Studies in Machine Learning Using the Game of Checkers II.
Recent Progress⊗*,
in the IBM Journal of Research and Development, vol. 11, no. 6, pp. 610-617,
November, 1967.

Schank, R. and K. Colby, ⊗4Computer Models of Thought and
Language.⊗* , W. H. Freeman, 1973.

<<Schlick ref?>

Schminke, C. W., and Arnold, William R., eds., ⊗4Mathematics is a Verb⊗*,
The Dryden Press, Hinsdale, Illinois, 1971.

Simon, Herbert A., ⊗4The Heuristic Compiler⊗*, in
[Simon & Siklossy 72], Part 1, Chapter 1, pp. 9-43, 1972.

Simon, Herbert A., and Laurent Siklossy, (eds.),
⊗4Representation and Meaning: Experiments with
Information Processing Systems⊗*, Prentice-Hall Inc., Englewood Cliffs, N.J.,
1972.

Simon, Herbert A., ⊗4Does Scientific Discovery Have a Logic?⊗*, Philosophy of
Science, Volume 40, No. 4, December, 1973, pp. 471-480.

⊗8α@⊗* Skemp, Richard R., ⊗4The Psychology of Learning Mathematics⊗*, 
Penguin Books, Ltd., Middlesex, England, 1971.

Sloman, Aaron, ⊗4Interactions Between Philosophy and Artificial 
Intelligence: The Role of Intuition and Non-Logical Reasoning in
Intelligence⊗*, Artificial Intelligence 2, 1971, pp. 209-225.

Sloman, Aaron, ⊗4On Learning about Numbers⊗*, source unknown.

Smith, Nancy Woodland, ⊗4A Question-Answering System for Elementary Mathematics⊗*,
Stanford Institute for Mathematical Studies in the Social Sciences, Technical
Report 227, April 19, 1974.

Spivak, Michael, ⊗4Calculus on Manifolds⊗*,  W.A.Benjamin, Inc., N.Y. 1965.

Stein, Sherman K., ⊗4Mathematics: The Man-Made Universe: An Introduction
to the Spirit of Mathematics⊗*, Second Edition, W. H. Freeman and 
Company, San Francisco,  1969.

Teitelman, Warren, ⊗4INTERLISP Reference
Manual⊗*, XEROX PARC, 1974.

Tullock, Gordon,  ⊗4The Organization of Inquiry⊗*, Duke U. Press, Durham, N. C.,
1966.

Venn, John, ⊗4The Principles of Empirical or Inductive Logic⊗*,
MacMillan and Co., London, 1889.

Waismann, Friedrich, ⊗4Introduction to Mathematical Thinking⊗*, 
Frederick Ungar Publishing Co., New York, 1951.

Wang, Hao, ⊗4Toward Mechanical Mathematics⊗*, IBM Journal of Research and
Development, Volume 4, Number 1, January, 1960, pp. 2-22.

Weizenbaum, Joseph, ⊗4Computer Power and Human Reason⊗*, W. H. Freeman, S.F., 1976.

Wickelgren, Wayne A., ⊗4How to Solve Problems: Elements of a Theory of Problems
and Problem Solving⊗*, W. H. Freeman and Co., Sanf Francisco, 1974.

Wilder, Raymond L., ⊗4Evolution of Mathematical Concepts⊗*, John Wiley & Sons,
Inc., NY, 1968.

Winograd, Terry, ⊗4Understanding Natural Language⊗*, Academic
Press, Inc., New York, New York, 1972.

Winston, Patrick, ⊗4Learning Structural Descriptions
from Examples⊗*, Ph.D. thesis, Dept. of Electrical Engineering,
TR-76, Project MAC, TR-231, MIT AI Lab, September, 1970.

Winston, P., (ed.),
"New Progress in Artificial Intelligence",
⊗4MIT AI Lab Memo AI-TR-310⊗*, June, 1974. 

Winston, P., (ed.),
⊗4The Psychology of Computer Vision⊗*,
McGraw Hill, N.Y. 1975.

Wittner, George E., ⊗4The Structure of Mathematics⊗*, Xerox College Publishing,
Lexington, Mass, 1972.

.END
.ASSECP(Documentation)

.BEGIN TURN OFF "@" TURN ON "{}"

Below are  listed  some references  to earlier  articles, to  on-line
documentation about AM, to the AM program itself, etc.

The AM  representation is a variant of  the "BEINGs" ideas, a modular
representation for  knowledge.    In  his summary  of  the  state  of
Automatic Programming [Bierman], Bierman compares BEINGs with Frames,
Actors, etc., and gives a nice example of BEINGs in action.

History  buffs  may be  interested  in perusing  the  original thesis
proposal  for   AM  (about   50  pages  long).     It   is  kept   as
SYS4[TLK,DBL]@SU-AI.

The  full  body of  knowledge  provided to  AM  is  found in  English
translation on file  GIVEN[TLK,DBL]@SU-AI. This is  a longer,  fuller
treatment  than  the   one  found  in  this  document,   in  Appendix
{[2]ALLCON}.1 and Appendix {[2]ALLHEU}.  The knowledge ⊗4as used⊗* is
of course the  AM program itself.   Needless to  say, it is  ⊗4much⊗*
longer than the excerpts shown in Appendix {[2]CONS}.{[3]CONSEC}.

Said running  AM program  is stored at  SUMEX, on  directory <LENAT>.
From  Interlisp, one need only  load in the file  <LENAT>LT.  This in
turn will load in three files: TOP6, CON6, and UTIL6.  So if you want
to steal AM, take all four files!

Once loaded,  the program is self-explanatory.   It will instruct the
user to type ⊗4(START)⊗*  to begin AM itself.  Once he does this,  AM
will    ask   him    some    questions,    and   then    enter    the
select-and-execute-a-job loop.

A crude "user's  manual" is stored as file MANUAL[AM,DBL]@SU-AI.  The
reader is urged to  glance over it before  running AM, since much  of
the actual  LISP code is  more complicated  than this thesis  made it
seem   (e.g.,   there   are   two   dynamically-adjusted   variables,
Verbosity-level  and Expert-level.  The  former  variable  determines
which events generate a  message, and the latter variable affects the
terseness of each of those printed messages.)

.END